一个线性约束优化问题的广义梯度投影法

本文对线性约束优化问题提出了一个新的广义梯度投影法，该算法采用了非精确线性搜索，并在每次迭代运算中结合了广义投影矩阵和变尺度方法的思想确定其搜索方向．在通常的假设条件下，证明了该算法的整体收敛性和超线性收敛速度．     

Periodic Optical Pulses in Nonlinear Optical Fibers

We discuss the problem of transmitting polarized pulses along optical fibers with variable dispersion. The dissipation and mean dispersion are assumed to be zero, which allows using the model of the vector nonlinear Schrödinger equation. We consider an optical fiber consisting of arms of equal length, which is assumed to be large. We propose an asymptotic recursive procedure for calculating the amplitude and the phase of an optical pulse propagating along the optical cable with variable dispersion.     

凹整数规划的分枝定界解法

凹整数规划是一类重要的非线性整数规划问题，也是在经济和管理中有着广泛应用的最优化问题．本文主要研究用分枝定界方法求解凹整数规划问题，这一方法的基本思想是对目标函数进行线性下逼近，然后用乘子搜索法求解连续松弛问题．数值结果表明，用这种分枝定界方法求解凹整数规划是有效的．     

四阶非线性边值问题解的存在性与上下解方法

该文讨论四阶常微分方程边值问题u^(4)(t)=f(t,u,u″), t∈［0,1］,u(0)=u(1)=u″(0)=u″(1)=0解的存在性, 其中f(t,u,v):［0,1］×R×R→R为Carathéodory函数. 在不限制f关于u,v的增长阶, 不假定f关于u,v的单调性的一般情形下, 用上下解方法获得了解的存在性结果,并讨论了单调迭代求解的有效性.     

奇异摄动罗宾问题在Bakhvalov-Shishkin网格上的一致收敛有限差分法

考虑一个奇异摄动罗宾问题在Bakhvalov-Shishkin网格上的迎风差分策略,得到在改进的Shishkin网格上迎风策略是关于ε一致的一阶L∞模收敛的.数值实验证实了此理论结果,显示估计是稳健的.     

A constructive procedure to recover asymptotics of short-range or long-range potentials

We study an inverse scattering problem for a pair of Hamiltonians (H,H₀) on L²(Rⁿ), where H₀=-Δ and H=H₀+V, V being a short- or long-range potential. By an elementary constructive method, we show that the scattering operator S, which is localized near a fixed energy λ>0, determines the asymptotics of the potential V at infinity, in dimension n?3. This is done by studying the action of the scattering operator on suitable wave packets.     

The mesa problem for Neumann boundary value problem

In this paper, we study the singular limit of the Porous Medium equation u_t=Δu^m+g(x,u), as m→∞, in a bounded domain with Neumann boundary condition.     

Local Feasible QP-Free Algorithms for the Constrained Minimization of SC1 Functions

We consider the problem of minimizing an SC¹ function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm.     

On the Application of the Auxiliary Problem Principle

The auxiliary problem principle (APP) derives from a general theory on decomposition-coordination methods establishing a comprehensive framework for both one-level and two-level methods. In this paper, the results of the two-level methods of APP are specialized for an efficient application to some engineering problems.     

随机交通均衡配流模型及其等价的变分不等式问题

本文讨论了交通网络系统的随机用户均衡原理的数学表述问题.在路段出行成本是流量的单调函数的较弱条件下,对具有固定需求和弹性需求的模式,首次证明了随机均衡配流模型可表示为一个变分不等式问题,同时也说明了该变分不等式问题与相应的互补问题以及一个凸规划问题之间的等价关系.